Complex Orthogonal Designs With Forbidden 2$\,\times\,$2 Submatrices
نویسندگان
چکیده
منابع مشابه
Complex Orthogonal Designs with Forbidden 2 × 2 Submatrices
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| )In×n. Define Oz an M-type COD if and only if Oz does not contain submatrix (
متن کاملComplex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| )In×n. Define Oz a first type COD if and only if Oz does not contain submatrix (
متن کاملOn linear forbidden submatrices
In this paper we study the extremal problem of finding how many 1 entries an n by n 0-1 matrix can have if it does not contain certain forbidden patterns as submatrices. We call the number of 1 entries of a 0-1 matrix its weight. The extremal function of a pattern is the maximum weight of an n by n 0-1 matrix that does not contain this pattern as a submatrix. We call a pattern (a 0-1 matrix) li...
متن کاملAmicable complex orthogonal designs
In this letter, we define amicable complex orthogonal designs (ACOD) and propose two systematic methods to construct higher-order ACOD’s from lower-order ACOD’s. Although the upper bound on the number of variables of ACOD’s is found to be the same as that of amicable orthogonal designs (AOD), we show that certain types of AOD’s that were previously shown to be non-existent or undecided, such as...
متن کاملComplex Orthogonal Designs
For p×n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate k p of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2195635